Blocking Behavior of Queueing System with Finite Buffer and Pseudo Self-similar Input
نویسنده
چکیده
It is well known that the fitting methods based on the second-order statistics of counts for the arrival process are not sufficient for predicting the performance of the queueing system with self-similar input. However recent studies have revealed that the loss probability of finite queuing system can be well approximated by the Markovian input models. This paper studies the time-scale impact on the loss probability of MMPP/D/1/K system where the MMPP is generated so as to match the variance of the self-similar process over specified time-scales. We investigate the loss probability changing system size, Hurst parameters and time-scales. Numerical examples show that the loss probability of MMPP/D/1/K are not significantly affected by the time-scale.
منابع مشابه
Internet Traffic Modeling: Markovian Approach to Self-Similar Traffic and Prediction of Loss Probability for Finite Queues
It has been reported that IP packet traffic exhibits the self-similar nature and causes the degradation of network performance. Therefore it is crucial for the appropriate buffer design of routers and switches to predict the queueing behavior with self-similar input. It is well known that the fitting methods based on the second-order statistics of counts for the arrival process are not sufficie...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملClosed-form Expected Queueing times of a Tandem System with Finite Intermediate Buffer: a Recursive Approach
4 this paper we deal with a two-station tandem queueing system incorporating a finite intermediate buffer between the stations. Blocking occurs when a customer is momentarily stopped at the fu-st station owing to a capacity limitation of the second station having been reached. We assume general input and exponentially distributed service times. We observe that it is possible to calculate the co...
متن کاملOverflow Probability in an ATM Queue with Self-Similar Input Traffic
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic processes. Measurements have also shown that, with increasing buffer capacity, the resulting cell loss is not reduced exponentially fast as it is predicted by Markov-model-based queueing theory but, in contrast, decrease...
متن کاملPower Tail Asymptotic Results of a Discrete Time Queue with Long Range Dependent Input
In this paper, we consider a discrete time queueing system fed by a superposition of an ON and OFF source with heavy tail ON periods and geometric OFF periods and a D-BMAP (Discrete Batch Markovian Arrival Process). We study the tail behavior of the queue length distribution and both infinite and finite buffer systems are considered. In the infinite buffer case, we show that the asymptotic tail...
متن کامل